Dynamic Optimization
نویسنده
چکیده
We distinguish static and dynamic optimization of programs: whereas static optimization modifies a program before runtime and is based only its syntactical structure, dynamic optimization is based on the statistical properties of the input source and examples of program execution. Explanation-based generalization is a commonly used dynamic optimization method, but its effectiveness as a speedup-learning method is limited, in part because it fails to separate the learning process from the program transformation process. This paper describes a dynamic optimization technique called a learn-optimize cycle that first uses a learning element to uncover predictable patterns in the program execution and then uses an optimization algorithm to map these patterns into beneficial transformations. The technique has been used successfully for dynamic optimization of pure Prolog.
منابع مشابه
A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملClustering and Memory-based Parent-Child Swarm Meta-heuristic Algorithm for Dynamic Optimization
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
متن کاملIntroducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems
The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...
متن کاملA New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem
The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...
متن کاملThe Comparison of Direct and Indirect Optimization Techniques in Equilibrium Analysis of Multibody Dynamic Systems
The present paper describes a set of procedures for the solution of nonlinear static-equilibrium problems in the complex multibody mechanical systems. To find the equilibrium position of the system, five optimization techniques are used to minimize the total potential energy of the system. Comparisons are made between these techniques. A computer program is developed to evaluate the equality co...
متن کاملSTATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION
Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...
متن کامل